complete forcing numbers of polyphenyl systems
نویسندگان
چکیده
the idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as latin squares, block designs and steiner systems in combinatorics (see [1] and the references therein). recently, the forcing on perfect matchings has been attracting more researchers attention. a forcing set of m is a subset of m contained in no other perfect matchings of g. a global forcing set of g, introduced by vukiˇcevi´c et al., is a subset of e(g) on which there are distinct restrictions of any two different perfect matchings of g. combining the above “forcing” and “global” ideas, xu et al. [5] introduce and define a complete forcing set of g as a subset of e(g) on which the restriction of any perfect matching m of g is a forcing set of m. the minimum cardinality of complete forcing sets is the complete forcing number of g. in this paper, we give the explicit expressions for the complete forcing number of several classes of polyphenyl systems.
منابع مشابه
Complete forcing numbers of polyphenyl systems
The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...
متن کاملForcing unbalanced complete bipartite minors
Myers conjectured that for every integer s there exists a positive constant C such that for all integers t every graph of average degree at least Ct contains a Ks,t minor. We prove the following stronger result: for every 0 < ε < 10−16 there exists a number t0 = t0(ε) such that for all integers t ≥ t0 and s ≤ εt/ log t every graph of average degree at least (1 + ε)t contains a Ks,t minor. The b...
متن کاملGraphs with Extremal Connected Forcing Numbers
Zero forcing is an iterative graph coloring process where at each discrete time step, a colored vertex with a single uncolored neighbor forces that neighbor to become colored. The zero forcing number of a graph is the cardinality of the smallest set of initially colored vertices which forces the entire graph to eventually become colored. Connected forcing is a variant of zero forcing in which t...
متن کاملForcing subarrangements in complete arrangements of pseudocircles
In arrangements of pseudocircles (i.e., Jordan curves) the weight of a vertex (i.e., an intersection point) is the number of pseudocircles that contain the vertex in its interior. We show that in complete arrangements (in which each two pseudocircles intersect) 2n−1 vertices of weight 0 force an α-subarrangement, a certain arrangement of three pseudocircles. Similarly, 4n−5 vertices of weight 0...
متن کاملHodge Numbers of Complete Intersections
Suppose X is a compact Kähler manifold of dimension n and E is a holomorphic vector bundle. For every p ≤ dim C X we have a sheaf Ω p (E) whose sections are holomorphic (p, 0)-forms with coefficients in E. We set and we define the holomorphic Euler characteristics χ p (X, E) := q≥0 (−1) q h p,q (X, E). It is convenient to introduce the generating function of these numbers χ y (X, E) := p≥0 y p ...
متن کاملForcing large complete minors in infinite graphs
It is well-known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalise the notion of the relative end degree, which had been previously introduced by the first author for locally finite graphs, and show that large minimum relative degree at the ends and large mi...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
iranian journal of mathematical chemistryناشر: university of kashan
ISSN 2228-6489
دوره 7
شماره 1 2016
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023